A Global Benefit Maximization Task-Bundle Allocation

نویسندگان

  • Meiguang Zheng
  • Zhigang Hu
  • Peng Xiao
  • Meixia Zheng
  • Kai Zhang
چکیده

Obtaining maximal benefit is usually the most important goal pursued by Grid resource/service provider. As providers and users being noncooperative inherently, it is a fundamental challenge to design a resource allocation strategy which seems to be fair. In order to adapt to large-scale Grid environment, we adopted a hierarchical grid structure with bundle tasks to describe the Grid system. A model called Intra-Site Cooperative-game of Taskbundle (ISCT) was proposed, in which all subordinate resources participated in making profits. We calculated task market price based on the theoretical proof that the system would gain maximal global benefit if and only if it was in a balanced state. Then we determined the task allocation solution with solving the task assignment amount vector. An Intra-Site Global Benefit Maximization Allocation for Task-bundle (ISGBMAT) was presented, which converted the Grid task-bundle allocation problem into an iteration process involving retail price, market price and assignment amount of tasks. Extensive simulation experiments with real workload traces were conducted to verify our algorithm. The experimental results indicated that ISGBMAT could provide an effective solution with global benefit and completion time optimization and also adapt to dynamic Grid market.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Decentralized Task Allocation for Dynamic Environments

This thesis presents an overview of the design process for creating greedy decentralized task allocation algorithms and outlines the main decisions that progressed the algorithm through three different forms. The first form was called the Sequential Greedy Algorithm (SGA). This algorithm, although fast, relied on a large number of iterations to converge, which slowed convergence in decentralize...

متن کامل

Approximability and Inapproximability of Social Welfare Optimization in Multiagent Resource Allocation

Resource allocation is a fundamental problem in the field of multiagent systems, where a set of resources need to be allocated to a group of agents in a way so as to optimizing social welfare. In the last few years this problem has received much attention, especially due to its wide applicability domain (see the survey of Chevaleyre et al. [CDE+06]). This thesis studies the approximability and ...

متن کامل

Sealed Bid Multi-object Auctions with Necessary Bundles and Its Application to Spectrums Auctions

In this paper, we consider multi-object auctions in which each bidder has a positive reservation value for only one special subset of objects, called a necessary bundle. In the auction, each bidder reports his necessary bundle and its reservation value. The seller solves the assignment problem of objects which maximizes his revenue and decides the winning bidders who can purchase their necessar...

متن کامل

Sealed Bid Multi-object Auctions with Necessary Bundles and its Application to Spectrum Auctions

In this paper, we consider multi-object auctions in which each bidder has a positive reservation value for only one special subset of objects, called a necessary bundle. In the auction, each bidder reports its necessary bundle and its reservation value. The seller solves the assignment problem of objects which maximizes its revenue and decides the winning bidders who can purchase their necessar...

متن کامل

Asynchronous Decentralized Task Allocation for Dynamic Environments

This work builds on a decentralized task allocation algorithm for networked agents communicating through an asynchronous channel. The algorithm extends the Asynchronous Consensus-Based Bundle Algorithm (ACBBA) to account for more real time implementation issues resulting from a decentralized planner. This work utilizes a new implementation that allows further insight into the consensus and mess...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011